منابع مشابه
A minus end checkpoint
A minus end checkpoint B oth ends of microtubules get in on spindle checkpoint signaling. From kinetochores, proteins at microtubule plus ends relay the results of proper spindle-tochromosome attachments. Now, Hannah Müller, Bodo Lange (Max Planck Institute for Molecular Genetics, Berlin, Germany), and colleagues fi nd that, at minus ends, γ-tubulin signals that all is well with microtubule nuc...
متن کامل3x+1 Minus the +
where d is a positive integer, 0≤ i< d and r0,r1, . . .rd−1 are rational numbers, such that the famous 3x+1 conjecture holds if and only if the R-orbit of 2n contains 2 for all positive integers n. We then show that the R-orbit of an arbitrary positive integer is a constant multiple of an orbit that contains a power of 2. Finally we apply our main result to show that any cycle {x0, . . . ,xm−1}...
متن کاملTwin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملThe minus k-domination numbers in graphs
For any integer , a minus k-dominating function is afunction f : V (G) {-1,0, 1} satisfying w) for every vertex v, where N(v) ={u V(G) | uv E(G)} and N[v] =N(v)cup {v}. The minimum of the values of v), taken over all minusk-dominating functions f, is called the minus k-dominationnumber and is denoted by $gamma_k^-(G)$ . In this paper, we introduce the study of minu...
متن کاملMinus domination in graphs
We introduce one of many classes of problems which can be defined in terms of 3-valued functions on the vertices of a graph G = (V, E) of the form f : V + { 1, 0, l}. Such a fknction is said to be a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every t’ E V, ,f(N[r~])> 1, where N[a] consists of 1: and every vertex adjacent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Iowa Review
سال: 2007
ISSN: 0021-065X,2330-0361
DOI: 10.17077/0021-065x.6278